Program Design in PVS
نویسنده
چکیده
Hoare triples (precondition, program, postcondition) have been incorporated in the veriication system PVS. Two approaches are presented: the conventional one, with a clear distinction between syntax and semantics, and another where programs are identiied with their semantics. In the last approach speciications are embedded in the semantic framework, leading to a formalism where speciications and programming constructs can be mixed freely. This framework forms the basis of a formal method for the design of distributed real-time systems.
منابع مشابه
Patterns and templates for automated verification of user interface software design in PVS
This paper introduces a set of PVS theories for modelling and analysis of usability and safety aspects of user interface software design. Our PVS theories crystallise general usability issues commonly addressed in user‐centred safety requirements, such as the ability to undo user actions, the visibility of operational modes, and the predictability of user interface behaviour. These requirements...
متن کاملApplication Specific Higher Order Logic Theorem Proving
Theorem proving allows the formal verification of the correctness of very large systems. In order to increase the acceptance of theorem proving systems during the design process, we implemented higher order logic proof systems for ANSI-C and Verilog within a framework for application specific proof systems. Furthermore, we implement the language of the PVS theorem prover as well-established hig...
متن کاملComputer-Aided Computing
Formal program design methods are most useful when supported with suitable mechanization. This need for mechanization has long been apparent, but there have been doubts whether veriication technology could cope with the problems of scale and complexity. Though there is very little compelling evidence either way at this point, several powerful mechanical veriication systems are now available for...
متن کاملTowards Verified Distributed Software Through Refinement of Formal Archetypes
This paper discusses experiments with a “model-based” approach for developing verified distributed systems in which program development is carried out by stepwise refinement: we encode, specifications and algorithm archetypes in the PVS theorem prover, carry out stepwise refinement and concomitant proofs, and obtain collections of verified algorithms encoded in PVS. Finally we transform algorit...
متن کاملSteps Toward Mechanizing Program Transformations Using PVS
PVS is a highly automated framework for speciication and veriication. We show how the language and deduction features of PVS can be used to formalize, mechanize , and apply some useful program transformation techniques. We examine two such examples in detail. The rst is a fusion theorem due to Bird where the composition of a catamorphism (a recursive operation on the structure of a datatype) an...
متن کامل